The Extended Frobenius Problem for Fibonacci Sequences Incremented by a Fibonacci Number
نویسندگان
چکیده
We study the extended Frobenius problem for sequences of form $\{f_a+f_n\}_{n\in\mathbb{N}}$, where $\{f_n\}_{n\in\mathbb{N}}$ is Fibonacci sequence and $f_a$ a number. As consequence, we show that family numerical semigroups associated to these satisfies Wilf's conjecture.
منابع مشابه
Independent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes
A subset S of vertices in a graph G is said to be an independent set of G if each edge in the graph has at most one endpoint in S and a set W ( V is said to be a resolving set of G, if the vertices in G have distinct representations with respect to W. A resolving set W is said to be an independent resolving set, or an ir-set, if it is both resolving and independent. The minimum cardinality of W...
متن کاملIndependent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes
A subset S of vertices in a graph G is said to be an independent set of G if each edge in the graph has at most one endpoint in S and a set W ( V is said to be a resolving set of G, if the vertices in G have distinct representations with respect to W. A resolving set W is said to be an independent resolving set, or an ir-set, if it is both resolving and independent. The minimum cardinality of W...
متن کاملIndependent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes
A subset S of vertices in a graph G is said to be an independent set of G if each edge in the graph has at most one endpoint in S and a set W ( V is said to be a resolving set of G, if the vertices in G have distinct representations with respect to W. A resolving set W is said to be an independent resolving set, or an ir-set, if it is both resolving and independent. The minimum cardinality of W...
متن کاملIndependent Resolving Number of Fibonacci Cubes and Extended Fibonacci Cubes
A subset S of vertices in a graph G is said to be an independent set of G if each edge in the graph has at most one endpoint in S and a set W ( V is said to be a resolving set of G, if the vertices in G have distinct representations with respect to W. A resolving set W is said to be an independent resolving set, or an ir-set, if it is both resolving and independent. The minimum cardinality of W...
متن کاملRandom Fibonacci Sequences and the Number
For the familiar Fibonacci sequence (defined by f1 = f2 = 1, and fn = fn−1 + fn−2 for n > 2), fn increases exponentially with n at a rate given by the golden ratio (1 + √ 5)/2 = 1.61803398 . . . . But for a simple modification with both additions and subtractions — the random Fibonacci sequences defined by t1 = t2 = 1, and for n > 2, tn = ±tn−1 ± tn−2, where each ± sign is independent and eithe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mediterranean Journal of Mathematics
سال: 2023
ISSN: ['1660-5454', '1660-5446']
DOI: https://doi.org/10.1007/s00009-023-02428-9